Weighted random subspace method for high dimensional data classification
نویسندگان
چکیده
منابع مشابه
Weighted random subspace method for high dimensional data classification.
High dimensional data, especially those emerging from genomics and proteomics studies, pose significant challenges to traditional classification algorithms because the performance of these algorithms may substantially deteriorate due to high dimensionality and existence of many noisy features in these data. To address these problems, pre-classification feature selection and aggregating algorith...
متن کاملA modular eigen subspace scheme for high-dimensional data classification
In this paper, a novel filter-based greedy modular subspace (GMS) technique is proposed to improve the accuracy of high-dimensional data classification. The proposed approach initially divides the whole set of high-dimensional features into several arbitrary number of highly correlated subgroups by performing a greedy correlation matrix reordering transformation for each class. These GMS can be...
متن کاملHybrid weighted random forests for classifying very high-dimensional data
Random forests are a popular classification method based on an ensemble of a single type of decision trees from subspaces of data. In the literature, there are many different types of decision tree algorithms, including C4.5, CART, and CHAID. Each type of decision tree algorithm may capture different information and structure. This paper proposes a hybrid weighted random forest algorithm, simul...
متن کاملOutlying Subspace Detection for High-Dimensional Data
Knowledge discovery in databases, commonly referred to as data mining, has attracted enormous research efforts from different domains such as databases, statistics, artificial intelligence, data visualization, and so forth in the past decade. Most of the research work in data mining such as clustering, association rules mining, and classification focus on discovering large patterns from databas...
متن کاملOutlying Subspace Detection for High- dimensional Data
Knowledge discovery in databases, commonly referred to as data mining, has attracted enormous research efforts from different domains such as database, statistics, artificial intelligence, data visualization, etc, in the past decade. Most of the research work in data mining such as clustering, association rules mining and classification focus on discovering the “large patterns” from databases (...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Statistics and Its Interface
سال: 2009
ISSN: 1938-7989,1938-7997
DOI: 10.4310/sii.2009.v2.n2.a5